Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Time and Job Splitting: Hospital Catering Case Study

نویسندگان

چکیده

This paper aims to study a real case of an optimization problem derived from hospital supply chain. The present work focuses on developing operational decision support models and algorithms for production process scheduling in catering. addressed system is considered as flexible job shop system. objective minimize the total flow time. A novel mathematical model two metaheuristics multi-product multi-stage food processes are developed. These methods have proven their effectiveness operations allowed significant improvements performance studied

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Job Shop Scheduling Problem with Sequence-Dependent Setup Times Considering Position-Based Learning Effects and Availability Constraints

 Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. ...

متن کامل

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

متن کامل

The Job-shop Scheduling Problem the Job-shop Scheduling Problem with Setup Times

This paper reports a bibliographical study and some personnal works about the general Jobshop Problem and Jobshop Problems with setup times. Section 1 introduces some { usual { notations about the general problem. Speciic notations concerning with setup times will be introduced later. The bibliograacal study, in Section 2 focuses on recent papers on both problems. Section 3 presents a general s...

متن کامل

New Routing Rules for Dynamic Flexible Job Shop Scheduling with Sequence-Dependent Setup Times

Flexible job shops are characterized by the existence of alternative –not necessarily identicalmachines, which permits parts to have different alternative routes in the shop. In a dynamic scheduling situation in which jobs continuously arrive over time, part routing rules are needed to deal with such routing flexibility as much as sequencing rules which define the order by which parts are admit...

متن کامل

Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2021

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app11041504